Reduction Strategies and Acyclicity
نویسندگان
چکیده
In this paper we review some well-known theory about reduction strategies of various kinds: normalizing, outermost-fair, cofinal, Church-Rosser. A stumbling block in the definition of such strategies is the presence of reduction cycles that may ‘trap’ a strategy as it is memory-free. We exploit a recently (re)discovered fact that there are no reduction cycles in orthogonal rewrite systems when each term has a normal form, in order to enhance some of the theorems on strategies, both with respect to their scope and the proof of their correctness.
منابع مشابه
Acyclicity and Coherence in Multiplicative Exponential Linear Logic
We give a geometric condition that characterizes MELL proof structures whose interpretation is a clique in non-uniform coherent spaces: visible acyclicity. We define the visible paths and we prove that the proof structures which have no visible cycles are exactly those whose interpretation is a clique. It turns out that visible acyclicity has also nice computational properties, especially it is...
متن کاملAcyclicity is Modular for Orthogonal TRSs
Acyclicity is shown to be a modular property of orthogonal first-order term rewriting systems (TRSs), which answers a question raised by Klop. Here, a rewrite system → is acyclic if it doesn’t allow non-empty cycles, where a cycle on t is a reduction sequence of the form t t. We assume knowledge of modularity, standardisation, tracing, and externality in term rewriting. To be specific, we freel...
متن کاملHigher-dimensional normalisation strategies for acyclicity
We introduce acyclic polygraphs, a notion of complete categorical cellular model for (small) categories, containing generators, relations and higher-dimensional globular syzygies. We give a rewriting method to construct explicit acyclic polygraphs from convergent presentations. For that, we introduce higher-dimensional normalisation strategies, defined as homotopically coherent ways to relate e...
متن کاملExtension Preservation Theorems on Classes of Acyclic Finite Structures
A class of structures satisfies the extension preservation theorem if, on this class, every first order sentence is preserved under extension iff it is equivalent to an existential sentence. We consider different acyclicity notions for hypergraphs (γ, β and α-acyclicity and also acyclicity on hypergraph quotients) and estimate their influence on the validity of the extension preservation theore...
متن کاملOn the Relationship of Joint Acyclicity and Super-Weak Acyclicity
Rules that allow existential quantifiers in the head (conclusion) have been studied extensively in knowledge representation, databases, and logic programming (in the related form of logic programs with function symbols). In general, it is not decidable if a set of such rules admits a finite model, but a number of sufficient conditions have been proposed to detect situations where this is the ca...
متن کامل